Locally connected VLSI architectures for the Viterbi algorithm

نویسندگان

  • P. Glenn Gulak
  • Thomas Kailath
چکیده

The Viterbi algorithm is a well-established technique for channel and source decoding in high performance digital communication systems. Implementations of the Viterbi algorithm on three types of locally connected processor arrays are described. This restriction is motivated by the fact that both the cost and performance metrics of VLSI favor architectures in which on-chip interprocessor communication is localized. Each of the structures presented can accommodate arbitrary alphabet sizes and algorithm memory lengths. The relative performance tradeoff s available to the designer are discussed in the context of previous work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VLSI Structures for Viterbi Receivers: Part I-General Theory and Applications

A taxonomy of VLSI grid model layouts is presented for the implementation of certain types of digital communication receivers based on the Viterbi algorithm. We deal principally with networks of many simple processors connected to perform the Viterbi algorithm in a highly parallel way. Two interconnection patterns of interest are he “shuffleexchange” and the “cube-connected cycles.” The results...

متن کامل

VLSI architectures for the MAP algorithm

This paper presents several techniques for the VLSI implementation of the MAP algorithm. In general, knowledge about the implementation of the Viterbi algorithm can be applied to the MAP algorithm. Bounds are derived for the dynamic range of the state metrics which enable the designer to optimize the word length. The computational kernel of the algorithm is the Add-MAX* operation, which is the ...

متن کامل

VLSI implementation of an area-efficient architecture for the Viterbi algorithm

The Viterbi algorithm is widely used in communications and signal processing. Recently, several area{ e cient architectures for this algorithm have been proposed. Area{e cient architectures trade speed for area by means of mapping the N states of the trellis describing the Viterbi algorithm to P processing elements, where N > P . In this paper a practical VLSI implementation of an area{e cient ...

متن کامل

VLSI Structures for Viterbi Receivers: Part II-Encoded MSK Modulation

Ahstrurt-As a specific application of the material presented in Part I, this companion paper identifies VLSI layout strategies for realizing corre-lative encoded MSK-type Viterbi receivers. When the source symbols are correlatively encoded using a first-order polynomial, the appropriate Viterbi receiver takes the form of a cube-connected cycle (CCC) structure. Second order encoding polynomials ...

متن کامل

Dynamic adaptation of quantization thresholds for soft-decision viterbi decoding with a reinforcement learning neural network

Two reinforcement learning neural network architectures which enhance the performance of a soft-decision Viterbi decoder used for forward error-correction in a digital communication system have been investigated and compared. Each reinforcement learning neural network is designed to work as a co-processor to a demodulator dynamically adapting the soft quantization thresholds toward optimal sett...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Journal on Selected Areas in Communications

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1988